CYCLIC PROPERTIES OF TRIANGULAR GRID GRAPHS
نویسندگان
چکیده
منابع مشابه
Hamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-connected, linearly convex triangular grid graphs (with the exception of one of them) are hamiltonian. The only exception is a graph D which is the linearlyconvex hull of the Star of David. We extend this result to a wider...
متن کاملLocal Properties of Triangular Graphs
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many various occasions. They model processor networks in which local computations can be easily implemented. The main issue addressed in the paper is to characterize class of triangular graphs (defined globally) by local m...
متن کاملWord-Representability of Face Subdivisions of Triangular Grid Graphs
A graph G = (V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if (x, y) ∈ E. A triangular grid graph is a subgraph of a tiling of the plane with equilateral triangles defined by a finite number of triangles, called cells. A face subdivision of a triangular grid graph is replacing some of its cells by plane copies of the...
متن کاملComplexity of the Hamiltonian Cycle Problem in Triangular Grid Graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. We show that the problem Hamiltonian Cycle is NP-complete for triangular grid graphs, while a hamiltonian cycle in connected, locally connected triangular grid graph can be found in polynomial time. 2000 Mathematics Subject Classification: 05C38 (05C45, 68Q25).
متن کاملwatching systems of triangular graphs
a watching system in a graph $g=(v, e)$ is a set $w={omega_{1}, omega_{2}, cdots, omega_{k}}$, where $omega_{i}=(v_{i}, z_{i}), v_{i}in v$ and $z_{i}$ is a subset of closed neighborhood of $v_{i}$ such that the sets $l_{w}(v)={omega_{i}: vin omega_{i}}$ are non-empty and distinct, for any $vin v$. in this paper, we study the watching systems of line graph $k_{n}$ which is called triangular grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2006
ISSN: 1474-6670
DOI: 10.3182/20060517-3-fr-2903.00092